A Feasibility Result for Interval Gaussian Elimination Relying on Graph Structure
نویسنده
چکیده
منابع مشابه
A Flexible Link Radar Control Based on Type-2 Fuzzy Systems
An adaptive neuro fuzzy inference system based on interval Gaussian type-2 fuzzy sets in the antecedent part and Gaussian type-1 fuzzy sets as coefficients of linear combination of input variables in the consequent part is presented in this paper. The capability of the proposed method (we named ANFIS2) for function approximation and dynamical system identification is remarkable. The structure o...
متن کاملMaximum Matchings in Planar Graphs via Gaussian Elimination 1
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(n'~ where co is the exponent of the best known matrix multiplication algorithm. Since co < 2.38, this algorithm breaks through the O (n J.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm lor generating perfect matchings in p...
متن کاملParallel Gaussian Elimination with Linear Work and Fill
This paper presents an algorithm for nding parallel elimination orderings for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the ordering produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the c...
متن کاملParallel Gaussian Elimination with Linear Work
This paper presents an algorithm for nding parallel elimination orderings for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the ordering produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the c...
متن کاملNon-interval greedoids and the transposition property
In previous papers we have mainly studied greedoids with the interval property. This paper exhibits 11 classes of greedoids whose members do not necessarily have the interval property. These non-interval greedoids are related to some fundamental algorithms and procedural principles like Gaussian elimination, blossom trees, series-parallel decomposition, ear decomposition, retracting and dismant...
متن کامل